# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    def findMinMoves(self, machines: List[int]) -> int:
        count = len(machines)
        total = sum(machines)

        if total % count > 0:
            return -1
        else:
            avg_count = total // count
            presum = 0
            ans = 0
            l_sum  = 0
            r_sum = total

            for i in range(count):
                a = max((i * avg_count - l_sum), 0)
                r_sum -= machines[i]
                b = max(((count-i-1) * avg_count - r_sum), 0)
                ans = max(ans, a+b)
                l_sum += machines[i]
            return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1, 0, 5], 3),
        ([0, 3, 0], 2),
        ([0, 2, 0], -1)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果

        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.findMinMoves(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

